Strategy-proof and anonymous allocation rules of indivisible goods: A new characterization of Vickrey allocation rule

نویسنده

  • Shigehiro Serizawa
چکیده

We consider situations where a society allocates a finite units of an indivisible good among agents, and each agent receives at most one unit of the good. For example, imagine that a government allocates a fixed number of licences to private firms, or imagine that a government distributes equally divided lands to households. We show that the Vickrey allocation rule is the unique allocation rule satisfying strategy-proofness, anonymity and individual rationality. 1. Introduction We consider situations where a society allocates a finite units of an indivisible good among agents, and each agent receives at most one unit of the good. For example, imagine that a government allocates a fixed number of licences to private firms, or imagine that a government distributes equally divided lands to households. 1 A number of allocation rules, including several forms of auction, are proposed for various social purposes such as efficiency , revenue maximization, etc. For the purpose of efficiency, one rule has a remarkable feature. It is " the Vickrey allocation rule ". First, the Vickrey allocation rule allocates the goods to agents evaluating the good highest. (" Efficiency ") Second, the Vickrey allocation rule extracts true information on agents' valuations from them. (" Strategy-Proofness ") Thirdly, the Vickrey allocation rule induces agents' voluntary participation. (" Individual Rationality ") And most importantly, as proved by Holmstrom (1979), the Vickrey allocation rule is the unique rule satisfying these three properties. It is well known that the Vickrey allocation rule also satisfies a property of impartiality called " anonymity ". In this paper, we characterize the Vickrey allocation rule by focusing on anonymity instead of efficiency. Our characterization emphasizes that the Vickrey allocation rule also has a remarkable feature for the purpose of impartiality. An allocation rule is generally formulated as a function from the set of agents' valuations on the good to the feasible set. An allocation rule is efficient if it allocates the goods to agents evaluating the good highest. Given an allocation rule, since agents' private valuations are not known to the others, there may be incentives for agents to misrepresent their values in order to manipulate the final outcomes to their favor. As a result, the actual outcomes may not constitute a socially desirable allocation relative to agents' true valuations. Therefore, allocation rules need to be immune to such strategic misrepresen-tation in order to securely attain a desirable allocation for agents' true …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizing Vickrey allocation rule by anonymity

We consider the problem of allocating finitelymany units of an indivisible good among a group of agents when each agent receives at most one unit of the good and pays a non-negative price. For example, imagine that a government allocates a fixed number of licenses to private firms, or that it distributes equally divided lands to households. Anonymity in welfare is a condition of impartiality in...

متن کامل

Characterizing false-name-proof allocation rules in combinatorial auctions

A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner. There have been several studies on characterizing strategyproof allocation rules. In particular, a condition called weakmonotonicity has been identified as a full characterization of strategy-proof allocation rules. Mor...

متن کامل

Strategy-proof allocation of indivisible goods

Strategy-proof allocation of a ®nite number of indivisible goods among a ®nite number of individuals is considered. The main result is that in a pure distributional case, a mechanism is strategy-proof, nonbossy and neutral if and only if it is serially dictatorial. If the indivisible goods are initially owned by the individuals, a mechanism is strategy-proof, individually rational and Pareto co...

متن کامل

Axiomatic and Computational Aspects of Scoring Allocation Rules for Indivisible Goods

We define a family of rules for dividing m indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents’ preferences over sets of goods are additive, but that the input is ordinal: each agent simply ranks single goods. Similarly to (positional) scoring rules in voting, a scoring vector s= (s1, . . . ,sm) consists of m nonincr...

متن کامل

Positional Scoring Rules for the Allocation of Indivisible Goods

We define a family of rules for dividing m indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents’ preferences over sets of goods are additive, but that the input is ordinal: each agent simply ranks single goods. Similarly to positional scoring voting rules in voting, a scoring vector s = (s1, . . . ,sm) consists of m n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006